Surface interpolation for sparse cross-sections using region correspondence

نویسندگان

  • G. M. Treece
  • R. W. Prager
  • A. H. Gee
  • L. Berman
چکیده

The ability to estimate a surface from a set of cross-sections allows calculation of the enclosed volume and display of the surface in three-dimensions (3-D). However, extracting the cross-sections (segmenting) can be very difficult, and automatic segmentation methods are not sufficiently robust to deal with all situations. Hence, it is an advantage if the surface reconstruction algorithm can work effectively on a small number of cross-sections. An algorithm is presented which can interpolate a surface through sparse, complex crosssections. This is an extension of maximal disc guided interpolation [1], which is itself based on shape based interpolation [2]. The performance of this algorithm is demonstrated on various types of medical data (X-ray Computed Tomography, Magnetic Resonance Imaging and three-dimensional ultrasound). Although the correspondence problem in general remains unsolved, it is demonstrated that correct surfaces can be estimated from limited real data, through the use of region rather than object correspondence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

3D Surface Reconstruction from Unorganized Sparse Cross Sections

In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising ...

متن کامل

Shape-Based 3D Surface Correspondence Using Geodesics and Local Geometry

This paper describes a new method for determining correspondence between points on pairs of surfaces based on shape using a combination of geodesic distance and surface curvature. An initial sparse set of corresponding points are generated using a shapebased matching procedure. Geodesic interpolation is employed in order to capture the complex surface. In addition, surface correspondence and tr...

متن کامل

3D Reconstruction from Sparse Unorganized Cross Sections

In this thesis work, we propose an algorithm for smooth 3D object reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on construction of a globally consistent signed distance function over the cutting planes. It uses a divide-and-conquer approach utilizing Hermite...

متن کامل

Polar stratospheric cloud visualization: volume reconstruction from intersecting curvilinear cross sections

The CALIPSO satellite launched by NASA in 2006 uses an on-board lidar instrument to measure the vertical distribution of clouds and aerosols along the orbital path. This satellite’s dense vertical sampling of the atmosphere provides previously unavailable information about the altitude and composition of clouds, including the polar stratospheric clouds (PSCs) that play an important role in the ...

متن کامل

3D Brain surface matching based on geodesics and local geometry

The non-rigid registration of surfaces is a complex and difficult task for which there are many important applications, such as comparing shape between deformable objects and comparing associated function. This paper presents a new approach for brain surface matching by determining the correspondence of 3D point sets between pairs of surfaces. The algorithm is based on shape using a combination...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999